Non-uniform automata over groups

Non-Uniform Automata Over Groups

A new model, non-uniform deterministic finite automata (NUDFA’s) over general tinite monoids, has recently been developed as a strong link between the theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform NC’, NUDFA characterizations of several important subclasses ...

Non-uniform Cellular Automata

In this paper we begin the study the dynamical behavior of non-uniform cellular automata and compare it to the behavior of “classical” cellular automata. In particular we focus on surjectivity and equicontinuity.

Extended finite automata over groups

Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for finite autómata over arbitrary groups. The closure properties of these autómata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abel...

A Fractal Non-Contracting Class of Automata Groups

Non-Uniform Cellular Automata a Review Non-Uniform Cellular Automata a Review

This tutorial intends to present an introduction to non-uniform cellular automata (CA). The difference between uniform cellular automata and non-uniform ones is that in uniform CA all cells share the same rule, or set of rules, in non-uniform CA this is not true, every cell can have a different sets of rules or even no rule at all. We will see here that this single difference increases the powe...